Explicit Substitutions and Intersection Types
نویسندگان
چکیده
Calculi of explicit substitutions have been introduced to give an account to the substitution process in lambda calculus. The idea is to introduce a notation for substitutions explicitely in the calculus. In other words one makes substitutions first class citizens whereas the classical lambda calculus leaves them in the meta-theory. Originally, the expression “explicit substitution” and the concept itself were introduced by Abadi, Cardelli, Curien and Levy [1]. The idea of the authors was to replace categorical combinators by a syntax that extend lambda calculus. Actually the idea of internalizing substitutions into the lambda calculus is older. A first credit should be given to Curien with his λρ calculus [4] which is the origin of the calculus of [1]. But Curry himself expressed the same wish much earlier. For him combinatory logic was a mean to analyze substitutions. In the introduction of his famous book [5] he noted the advantage of including a calculus of substitutions into the lambda calculus. Perhaps the idea of explicit substitution is not “explicit” there, but at least the program of building a simple system, which analyzes substitutions and which departs less of our intuition than combinatory logic, appears clearly. For Curry this system should not be far from lambda calculus. Nowadays, we would call such a system a “calculus of explicit substitution”. Another ancestor of calculi of explicit substitutions is de Bruijn λCξφ [7]. As its complicated name might indicate, λCξφ is not an easy calculus as it mixes up the concrete and the abstract syntax in the same framework. In [2], this calculus has been revisited in modern notations. At the noticeable exception of λχ [10] which uses de Bruijn levels, most of these calculi use de Bruijn indices [6] but more natural approaches have been proposed where names for variables are made explicit like in classical lambda-calculus. The most popular presentation is due to Roel Bloo and Kristoffer Rose [3], but Lins [11] proposed a calculus with the same features in 1985. The work presented here is the result of a cooperation with Daniel Dougherty and Stéphane Lengrand [9, 8].
منابع مشابه
Intersection types for explicit substitutions
We present a new system of intersection types for a composition-free calculus of explicit substitutions with a rule for garbage collection, and show that it characterizes those terms which are strongly normalizing. This system extends previous work on the natural generalization of the classical intersection types system, which characterized head normalization and weak normalization, but was not...
متن کاملIntersection Type Systems and Explicit Substitutions Calculi
The λ-calculus with de Bruijn indices, called λdB, assembles each α-class of λ-terms into a unique term, using indices instead of variable names. Intersection types provide finitary type polymorphism satisfying important properties like principal typing, which allows the type system to include features such as data abstraction (modularity) and separate compilation. To be closer to computation a...
متن کاملPrincipal Typings in a Restricted Intersection Type System for Beta Normal Forms with De Bruijn Indices
The λ-calculus with de Bruijn indices assembles each α-class of λterms in a unique term, using indices instead of variable names. Intersection types provide finitary type polymorphism and can characterise normalisable λ-terms, that is a term is normalisable if and only if it is typeable. To be closer to computations and to simplify the formalisation of the atomic operations involved in β-contra...
متن کاملNon-idempotent intersection types and strong normalisation
We present a typing system with non-idempotent intersection types, typing a term syntax covering three different calculi: the pure λ-calculus, the calculus with explicit substitutions λS, and the calculus with explicit substitutions, contractions and weakenings λlxr. In each of the three calculi, a term is typable if and only if it is strongly normalising, as it is the case in (many) systems wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007